RAINBOW CONNECTION NUMBER OF FLOWER SNARK GRAPH
نویسندگان
چکیده
منابع مشابه
Rainbow Connection Number of the Thorn Graph
A path in an edge colored graph is said to be a rainbow path if every edge in this path is colored with the same color. The rainbow connection number of G, denoted by rc(G), is the smallest number of colors needed to color its edges, so that every pair of its vertices is connected by at least one rainbow path. A rainbow u − v geodesic in G is a rainbow path of length d(u, v), where d(u, v) is t...
متن کاملRainbow Connection Number of Graph Power and Graph Products
The minimum number of colors required to color the edges of a graph so that any two distinct vertices are connected by at least one path in which no two edges are colored the same is called its rainbow connection number. This graph parameter was introduced by Chartrand et al. in 2008. The problem has garnered considerable interest and several variants of the initial version have since been intr...
متن کاملRainbow Connection Number of Graph Power and Graph Products
Rainbow connection number, rc(G), of a connected graph G is the minimum number of colors needed to color its edges so that every pair of vertices is connected by at least one path in which no two edges are colored the same (Note that the coloring need not be proper). In this paper we study the rainbow connection number with respect to three important graph product operations (namely cartesian p...
متن کاملOriented diameter and rainbow connection number of a graph
The oriented diameter of a bridgeless graph G is min{diam(H) |H is an orientation of G}. A path in an edge-colored graph G, where adjacent edges may have the same color, is called rainbow if no two edges of the path are colored the same. The rainbow connection number rc(G) of G is the smallest integer k for which there exists a k-edge-coloring of G such that every two distinct vertices of G are...
متن کاملRainbow Vertex-Connection Number of 3-Connected Graph
A path in an edge colored graph is said to be a rainbow path if every edge in this colored with the same color. A vertex-colored graph G is rainbow vertex-connected if any pair of vertices in G are connected by a path whose internal vertices have distinct colors. The rainbow vertexconnection number of G denoted by rvc(G), is the smallest number of colors that are needed in order to make G rainb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Apllied Mathematics
سال: 2020
ISSN: 1311-1728,1314-8060
DOI: 10.12732/ijam.v33i4.4